Algebraic Soft-Decision Techniques for Linear Block Codes
نویسندگان
چکیده
منابع مشابه
Genetic Algorithms for Soft-Decision Decoding of Linear Block Codes
Soft-decision decoding is an NP-hard problem of great interest to developers of communication systems. We show that this problem is equivalent to the problem of optimizing Walsh polynomials. We present genetic algorithms for soft-decision decoding of binary linear block codes and compare the performance with various other decoding algorithms including the currently developed A* algorithm. Simul...
متن کاملHdl Implementation of Algebraic Soft Decision Algorithm for Rs Codes
Reed Solomon (RS) codes are widely used to detect and correct data errors in transmission and storage systems. Hence it is used in many digital communication and storage devices. In existing system Reformulated inversion less Burst error correcting (RiBC) algorithm is used. But it lacks in speed, throughput & area. To overcome this Algebraic Soft Decision (ASD) algorithm is proposed. This Propo...
متن کاملAlgebraic Construction of Tail-Biting Trellises for Linear Block Codes
In this paper, we present an algebraic construction of tail-biting trellises. The proposed method is based on the state space expressions, i.e., the state space is the image of the set of information sequences under the associated state matrix. Then combining with the homomorphism theorem, an algebraic trellis construction is obtained. We show that a tailbiting trellis constructed based on the ...
متن کاملMaximum-likelihood Soft-decision Decoding for Binary Linear Block Codes Based on Their Supercodes
Based on the notion of supercodes, we propose a two-phase maximum-likelihood soft-decision decoding (tpMLSD) algorithm for binary linear block codes in this work. The first phase applies the Viterbi algorithm backwardly to a trellis derived from the parity-check matrix of the supercode of the linear block code. Using the information retained from the first phase, the second phase employs the pr...
متن کاملIterative Algebraic Soft Decision Decoding of Reed-Solomon Codes
In this paper, we propose an iterative soft decision decoding scheme for Reed Solomon codes with near maximum likelihood performance. The advantage of this decoding algorithm over previously proposed algorithms is its fast convergence in terms of the number of iterations required. This is achieved by combining two powerful soft decision decoding techniques which were previously regarded in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Communication and Information Systems
سال: 1990
ISSN: 1980-6604
DOI: 10.14209/jcis.1990.4